基于OPNET的战场IPV6通信网络拓扑设计及仿真

为了对IPv6与IPv4共存期间进行可靠通信提供技术上的参考,基于OPNET仿真平台,设计了几种不同的战场IPv6通信网络拓扑,强调了其特点和关键技术,突出了其仿真的主要参数配置,并通过分析仿真数据,对网络的有效性、实时性、可靠性等性能参数进行了评估,从而验证了所设计拓扑的可行性.     

基于粗集的神经网络在目标类型识别中的研究

为克服传统的目标类型识别方法的不足,提出将粗集和神经网络紧耦合建立新的识别模型,即经过识别信息预处理、样本数据粗集方法简化、神经网络学习训练及待识信息网络识别等步骤,充分融合了粗集强大的规则提取能力和神经网络优良的分类能力。实验表明,该模型减少了识别的主观因素,简化了神经网络结构,提高了运算速度。     

区域防空反导火控网的数据融合问题研究

由于组成区域防空反导火控网的各部光电瞄具之间是异步工作的,造成跟踪参数融合上出现较大误差,为此,提出一种解决异步数据融合问题的方法,并进行了计算机仿真,结果证明该方法可以有效完成火控系统参数融合问题。     

基于ANN的高炮火力单元射击有利度评估

采用ANN(人工神经网络)方法对高炮火力单元射击有利度进行评估是一种新的尝试。在对各影响因素进行分析与量化处理的基础上,建立了基于ANN的高炮火力单元射击有利度评估网络模型,并提供了网络的解算方法。通过某型高炮对不同目标射击的已知有利度评估值对网络进行的训练,确定了网络的各权值,并使学习误差达到了预先规定的标准,实现了对该型高炮对空射击有利度的评估。     

基于贝叶斯网络的计算机网络端到端服务故障诊断

研究了利用贝叶斯网络不确定推理技术实现端到端服务故障诊断的方法,详细描述了贝叶斯网络故障诊断模型的建立方法,设计了基于Pearl信念传播机制的故障诊断算法,并对其进行了改进,以提高诊断效果.最后,通过仿真验证了该方法的有效性,并提出了下一步的研究方向.     

改进的蚁群算法及其在卫星网络路由计算中的应用

介绍了蚁群算法的原理,然后对现有蚁群算法进行了一些改进,使它能够快速地收敛以满足高速变化的卫星网络拓扑结构.采用改进的虚拟拓扑策略解决了卫星网络拓扑高速变换的问题,将改进的蚁群算法应用于其上,并给出了相应的性能评估.所提出的改进的虚拟拓扑策略,能够大大减少一个系统周期内卫星网的时间片个数.应用于此基础上的改进的蚁群算法也体现了较好的性能.     

Probabilistic resource pooling games

We study a setting with a single type of resource and with several players, each associated with a single resource (of this type). Unavailability of these resources comes unexpectedly and with player‐specific costs. Players can cooperate by reallocating the available resources to the ones that need the resources most and let those who suffer the least absorb all the costs. We address the cost savings allocation problem with concepts of cooperative game theory. In particular, we formulate a probabilistic resource pooling game and study them on various properties. We show that these games are not necessarily convex, do have non‐empty cores, and are totally balanced. The latter two are shown via an interesting relationship with Böhm‐Bawerk horse market games. Next, we present an intuitive class of allocation rules for which the resulting allocations are core members and study an allocation rule within this class of allocation rules with an appealing fairness property. Finally, we show that our results can be applied to a spare parts pooling situation.     

Cost allocation rules for elastic single‐attribute situations

Many cooperative games, especially ones stemming from resource pooling in queueing or inventory systems, are based on situations in which each player is associated with a single attribute (a real number representing, say, a demand) and in which the cost to optimally serve any sum of attributes is described by an elastic function (which means that the per‐demand cost is non‐increasing in the total demand served). For this class of situations, we introduce and analyze several cost allocation rules: the proportional rule, the serial cost sharing rule, the benefit‐proportional rule, and various Shapley‐esque rules. We study their appeal with regard to fairness criteria such as coalitional rationality, benefit ordering, and relaxations thereof. After showing the impossibility of combining coalitional rationality and benefit ordering, we show for each of the cost allocation rules which fairness criteria it satisfies. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 271–286, 2017     

基于自然连通度的复杂网络节点重要性度量方法

节点重要性度量是复杂网络研究中的热点问题。从复杂网络的抗毁性指标入手,给出了自然连通度的定义,并且以此为基础设计了基于自然连通度的复杂网络节点重要性度量方法。最后以著名的风筝网络为例,分析了该方法的适用性,并与其他经典的节点重要性度量方法进行对比,证明了该方法的合理性。